<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en"><!-- InstanceBegin template="/Templates/insidepage_xml.dwt.php" codeOutsideHTMLIsLocked="true" -->


<head>
<!-- Template System Version 1.7Beta - any questions should be directed to Rommil Santiago, rommil.santiago@concordia.ca -->

<meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
<title>Lecture Series - Computer Science &amp; Software Engineering - Concordia University - Montreal, Quebec, Canada</title>
<meta name="verify-v1" content="knGpcn5wDEFQ5p/n0gKYttiwWSEJ7At+hfca0wnlyTY=" />
<meta name="msvalidate.01" content="5304EFE61919169FD1CFEADFFE36975A" />
<meta name="description" content="" />
<meta name="keywords" content="" />
<meta name="hidden" content="" />
<meta name="owner" content="Computer Science &amp; Software Engineering" />
<meta name="author" content="Concordia University" />
<meta name="copyright" content="Concordia University" />
<meta name="meta_tag_generator" content="" />
<meta name="robots" content="all,index" />
<meta name="resource-type" content="document" />
<meta name="distribution" content="global" />
<meta name="classification" content="" />
<meta name="rating" content="general" />
<meta name="language" content="en-ca" />
<link rel="shortcut icon" href="http://web2.concordia.ca/globalmk/favicon.ico" />
<link rel="stylesheet" href="http://web2.concordia.ca/globalmk/stylesheets/common.php" type="text/css" media="all" charset="UTF-8" />
<style type="text/css">
<!--
	#homebutton{
		margin:0;
		padding:0;
		height:145px;
		width:329px;
		display:block;
		overflow:hidden;
		position:absolute;
		top:9px;
		left:9px;
	}
	
	img#concordialogo{
		position:absolute;
		left:0;
		top:0;
		border:0;
		z-index:256;
	}
	
	#homebutton a{
		margin:0;
		padding:0;
		position:absolute;
	}
	
	
	#homebutton a:hover img#concordialogo{
		top:-145px;
	}
	
	#banner img.homebutton_ie6{
		top:-145px;
	}
	#banner img.homebutton_ie6_off{
		position:static;
	}	
	#concordialogo{
		margin:0;
		padding:0;
		position:static;
	}
-->
</style>
<link rel="stylesheet" href="http://www.cse.concordia.ca/stylesheets/custom.php?secure=&version=1.7Beta" type="text/css" media="all" charset="UTF-8" />
<!--[if lt IE 7]><link rel="stylesheet" href="../../stylesheets/ie6.css" type="text/css" media="all" charset="UTF-8" /><![endif]-->
<!--[if IE 7]><link rel="stylesheet" href="../../stylesheets/ie7.css" type="text/css" media="all" charset="UTF-8" /><![endif]-->
<link rel="stylesheet" href="http://www.cse.concordia.ca/stylesheets/m.css" type="text/css" media="all" charset="UTF-8" title="text_m" />
<link rel="alternate stylesheet" type="text/css" href="http://www.cse.concordia.ca/stylesheets/l.css" media="all" charset="UTF-8" title="text_l" />
<link rel="alternate stylesheet" type="text/css" href="http://www.cse.concordia.ca/stylesheets/xl.css" media="all" charset="UTF-8" title="text_xl" />
<!-- <link rel="stylesheet" type="text/css" media="print" href="../../stylesheets/print.css" />-->
<script src="http://web2.concordia.ca/globalmk/scripts/styleswitcher.php" type="text/javascript" charset="UTF-8"> </script>
<script src="http://web2.concordia.ca/globalmk/scripts/domeffects.php" type="text/javascript" charset="UTF-8"> </script>
<script src="http://web2.concordia.ca/globalmk/scripts/bottombar.php" type="text/javascript" charset="ISO-8859-1"> </script>
<script type="text/javascript" src="http://web2.concordia.ca/globalmk/scripts/livevalidation_standalone.php"> </script>
<script type="text/javascript">
		window.addEvent('domready',function(){activesearch(); queryclick(); sizebuttons(); styleswitcher(); queryclick_media(); tablelinks(); showbookmarks(); alternateRows(); 
				breakawaynav_arrows(); homebutton(); 				replaceShareThis();
		// Add your extra scripts here		
		}
		);
	</script>
<script src="http://web2.concordia.ca/globalmk/scripts/swfobject.php" type="text/javascript" charset="UTF-8"> </script>




<!-- AZ INDEX SUGGESTIONS-->

<script src="http://web2.concordia.ca/globalmk/scripts/jquery.php" type="text/javascript"></script>
<script src="http://web2.concordia.ca/globalmk/scripts/quickaccess.php" type="text/javascript"></script>
<script type="text/javascript">
	if (!window.opera){
		$(document).ready(function() { // jQuery onload
			livesearch_init();
			$('#search_toplevel_query').quickaccess({selector:'#search_listing a'});
			movelisting();
			togglesmartsearch();
		// staff and directory
		if (!baseURL)
		staffDirectory('http://www.cse.concordia.ca');		
		textsizeactive();
		
	});}
	
</script>


</head>



<body id="body_li_lectureseries_2" class="li_mainmenu_newsandevents_1 li_submenu_lectureseries_2" >
<!-- Contribute/DW Template System Version 1.7Beta or help contact Rommil Santiago (rommil.santiago@concordia.ca) -->
<div id="top"></div>
<div id="globaltools">
  <div id="globaltools_bg">
    <div class="globaltools_pagewidth">
      <h2 class="hide">Accessibility Tools</h2>
      <ul class="accesstools">
        <li><a href="http://www.cse.concordia.ca/newsandevents/lectureseries/#maincontent" accesskey="s">Skip to Content</a></li>
        <li><a href="../../accessibility.php" accesskey="0">Accessibility</a></li>
        <li id="textsize_li">Text Size: <span id="textsizetools"><a href="http://www.cse.concordia.ca/accessibility.php#textsize_faq">N/A</a></span></li>
				
      </ul>
	  
<h3 class="hide">Breadcrumb</h3>  
	  
	  
      <ul class="globalbreadcrumb">
        <li><a href="../../../pageswww.concordia.ca/index.html" accesskey="h">Concordia Home</a><img src="http://www.cse.concordia.ca/images/common/globaltoolbar_arrow_white.gif" alt=">" class="globaltools_arrow" /></li>
		
		    		<li><a href="../../../pages/index.html">ENCS</a><img src="http://www.cse.concordia.ca/images/common/globaltoolbar_arrow_white.gif" alt=">" class="globaltools_arrow" /></li>
		 		
		<li><a href="../../index.html">Computer Science &amp; Software Engineering Home</a></li>
	  </ul>
	  <div class="clear">&nbsp;</div>
    </div>
  </div> 
</div>
  
  

<div id="page">
	<div id="banner">
<div id="homebutton">
<a href="http://www.cse.concordia.ca/index.php" accesskey="1" title="Return to the Computer Science & Software Engineering Homepage">
<img src="http://www.cse.concordia.ca/custom/images/departmentlogo.gif" alt="Computer Science & Software Engineering" id="concordialogo" /></a>
</div>
    <h3 class="hide">Search</h3>
<div id="search" class="search">
      <form id="search_toplevel" action="http://www.cse.concordia.ca/scripts/searchredirect.php">
        <ul class="li_thissite" id="search_option_list">
 		  <li><a href="../../../pageswww.google.ca/search_hl_en_q_site_3Ahttp___www.cse.concordia.ca_btnG_Search_meta_" id="li_thissite">CSE</a></li>
          <li><a href="http://www.google.ca/search?hl=en&q=site%3Ahttp%3A%2F%2Fwww.concordia.ca&btnG=Search&meta=" id="li_entire">All of Concordia</a></li>
          <li><a href="http://www.concordia.ca/directory/" id="li_staff">Staff &amp; Faculty Directory</a></li>
          <!--<li><a href="http://news.concordia.ca/" id="li_news">News</a></li>
          <li><a href="http://www3.concordia.ca/events/" id="li_events">Events</a> </li>-->
        </ul>
        <div id="search_toplevel_tools">
		  <label for="search_toplevel_query" class="hide">Search Query</label>
		           	 <input id="search_toplevel_query" name="query" value="Enter your Query here" type="text" accesskey="4" />
		            <input type="submit" value="Search" id="search_toplevel_submit"/>
          <input id="search_selected" name="li_thissite" value="1" type="hidden" />
		  <input id="search_sitename" name="sitename" value="Computer Science &amp; Software Engineering" type="hidden" />
		  <input id="search_googleraw" name="googleraw" value="cx=006658531582020549846%3Ajpswjb-rrj4&amp;cof=FORID%3A11&amp;sa=Search" type="hidden" />
		  <input id="javascript_enabled" name="javascript_enabled" value="0" type="hidden" />
        </div>
      </form>
    </div>
<h2 class="hide">Main Menu</h2>
<div id="mainmenu">
<ul class="themainmenu"> <li id="li_mainmenu_prospectivestudents_1" >
<a class="li_mainmenu_prospectivestudents_1_a" href="../../prospectivestudents/index.html">
Prospective Students </a>
</li>
<li id="li_mainmenu_currentstudents_1" >
<a class="li_mainmenu_currentstudents_1_a" href="../../currentstudents/index.html">
Current Students </a>
</li>
<li id="li_mainmenu_people_1" >
<a class="li_mainmenu_people_1_a" href="../../people/index.html">
People </a>
</li>
<li id="li_mainmenu_research_1" >
<a class="li_mainmenu_research_1_a" href="../../research/index.html">
Research </a>
</li>
<li id="li_mainmenu_aboutthedepartment_1" >
<a class="li_mainmenu_aboutthedepartment_1_a" href="../../aboutthedepartment/index.html">
About the Department </a>
</li>
<li id="li_mainmenu_newsandevents_1" class="active">
<a class="li_mainmenu_newsandevents_1_a" href="../index.html">
News and Events </a>
</li></ul>
</div>
  </div>	<h2 class="hide">News and Events</h2>
<div class="submenu">
<ul id="ul_newsandevents"> <li id="li_submenu_lectureseries_2" class="active">
<strong>Lecture Series </strong></li>
<li id="li_submenu_thesesdefenses_2" >
<a class="li_submenu_thesesdefenses_2_a" href="http://www.cse.concordia.ca/newsandevents/thesesdefenses/">
Theses Defenses </a>
</li>
<li id="li_submenu_newsarchives_2" >
<a class="li_submenu_newsarchives_2_a" href="http://www.cse.concordia.ca/newsandevents/newsarchives/">
News Archives </a>
</li></ul>
</div>
	<div id="maincontent"  class="topgutter"  >
		<div id="lh_menu_area">
			</div>
		<div class="insidecontent  twothirds">

	
		<p class="breadcrumb"><a href="../../index.html">Computer Science &amp; Software Engineering Home</a> &gt; <a href="http://www.cse.concordia.ca/newsandevents/index.php">News and Events</a> &gt; </p>
		
	<h1>Lecture Series</h1>

	
		<h3 class="hide">Local tools</h3>
	<div id="localtools_wrapper">
	<ul id="localtools">
					<li>&nbsp;</li>
		
		
		
		<li class="emailtofriend" id="emailtofriend">
		

			<span id="emaillink">&nbsp;</span>

		</li>
		<li class="printable"><a href="http://www.cse.concordia.ca/newsandevents/lectureseries/?&print=1">Printable version</a></li>
			</ul>
	</div>
	











<!-- MAIN CONTENT AREA - START -->


			<div class="contentcolumn">
				<br class="hide" />
<!-- InstanceBeginEditable name="maincontent" --><!-- FCKEDITOR_maincontent --><!-- /FCKEDITOR_maincontent --> <!-- InstanceEndEditable -->

<!-- InstanceBeginEditable name="MainContent" -->

<a name="April-15-2009"></a>
<h3>Seminars</h3>
<h3>Lecture by Dr. Frank Rudzicz (University of Toronto) :</h3>
<h3>&nbsp;</h3>
<h3>FIRST, WE SHAPE OUR TOOLS: HOW TO BUILD A BETTER SPEECH RECOGNIZER</h3>
<p>Friday, December 2, 14:00, EV003.309</p>
<p>&nbsp;</p>
<p><span style="font-weight: bold">Abstract:</span></p>
<p wrap="">In this talk I briefly survey some of my previous research and then even   more briefly extrapolate as to future extensions of this work. I will talk about improving Automatic Speech Recognition (ASR) for speakers   with speech disabilities by incorporating knowledge of their speech   production. This involves the acquisition of the TORGO database of disabled   articulation which demonstrates several consistent behaviours among speakers,   including predictable pronunciation errors. Articulatory data are then used   to train augmented ASR systems that model the statistical relationships   between the vocal tract and its acoustic effluence. I show that dynamic   Bayesian networks augmented with instantaneous articulatory variables   outperform even discriminative alternatives. This leads to work that   incorporates a more rigid theory of speech production, i.e., task-dynamics,   that models the high-level and long-term aspects of speech production. For   this task, I devised an algorithm for estimating articulatory positions given   only acoustics that significantly outperforms the former state-of-the-art.     Finally, I present ongoing work into the transformation of disabled speech   signals in order to make them more intelligible to human listener and I   conclude with some thoughts as to possible paths we may now take. </p>
<p wrap=""><img src="http://www.cse.concordia.ca/documents/other documents/image001.jpg" width="125" height="171"></p>
<p style="font-weight: bold">Bio:</p>
Frank Rudzicz received his PhD in Computer Science from the University of   Toronto in 2011, his Master&rsquo;s degree in Electrical and Computer Engineering   from McGill University in 2006 and his Bachelor&rsquo;s in Computer Science at   Concordia University in 2004 He is the recipient of a MITACS Accelerate   Canada award, a MITACS Industrial Elevate award, and an NSERC Canada Graduate   Scholarship. His expertise includes parsing in natural language processing,   acoustic modelling, multimodal interaction, and speech production.
<p>&nbsp;</p>
<p align="center">________________________________________________</p>
<h3>&nbsp;</h3>
<h3>Lecture by Wojciech Szpankowski   (Dept. Computer Science, Purdue University, IN) :</h3>
<p>&nbsp;</p>
<h3>ALGORITHMS, COMBINATORICS, INFORMATION, AND BEYOND </h3>
<p>Monday, October.3, 2011, 10:30am, EV003.309 (open to all) <br />
</p>
<p><img src="http://www.cse.concordia.ca/documents/other documents/poster.JPG" width="680" height="1399"></p>
<p align="left">View high-resolution version of poster <a href="http://www.cse.concordia.ca/documents/other documents/Poster.pdf">here</a>. </p>
<p align="center">________________________________________________</p>
<h3>Lecture by Professor G.C. Sharma   (Department of   Mathematics and Computer Science, Institute of Basic Science, Agra) :</h3>
<p>&nbsp;</p>
<h3>PERFORMANCE ANALYSIS OF MANUFACTURING SYSTEM WITH STANDBYS, WORKING VACATION AND SERVER BREAKDOWN </h3>
<p>Wednesday, July 6, 2011, 13:00, EV003.309<br />
    <br />
    <br />
    <span style="font-weight: bold"> Abstract:</span></p>
<p>This investigation is concerned with queueing model for the performance   analysis of manufacturing system with standbys, working vacation and   server breakdown. As soon as an operating unit fails, it is immediately   replaced by a standby unit for the smooth running of the manufacturing   system. When there is no failed unit in the system, the server goes on   vacation; in the meanwhile, the server performs some work and is called   on working vacation. The life time and the repair time of the   manufacturing units are assumed to be exponentially distributed. The   matrix geometric method is used to evaluate various performances such as   the expected number of failed units and the expected number of operating   units in the manufacturing system, machine availability, operating   utilization, etc.. The cost function is established to maximize the   gain. The sensitivity analysis is also carried out to examine the effect   of different parameters on various system characteristics. </p>
<p style="font-weight: bold">Bio:</p>
<p>Professor G.C. Sharma was Ex-Professor and Head, Department of   Mathematics and Computer Science, Institute of Basic Science, Agra. He   was the founder director of &ldquo;Seth Padam Chand Jain Institute of   Commerce, Business Administration and Economics&rdquo;, &ldquo;Institute of   Vocational Education&rdquo; and &ldquo;Institute of Engineering and Technolog&rdquo; of   Dr. B. R. Ambedkar University, Agra. More than 50 students received   their Ph. D. Degree under his supervision. More than 150 research papers   and 20 books are to his credit. His area of research includes queueing   and reliability models, computational fluid dynamics, Bio-informatics,   etc. At present he is actively engaged in the interdisciplinary research   of modeling of humane diseases namely HIV, TB, Malaria, cancer, etc.</p>
<p align="center">________________________________________________</p>
<p>&nbsp;</p>
<h3>Lecture by Dr Madhu Jain  (Department of Mathematics, Indian   Institute of Technology, Roorkee, India) :</h3>
<p>&nbsp;</p>
<h3>	QUEUEING MODELLING AND OPTIMAL CHANNEL ALLOCATION IN WIRELESS COMMUNICATION NETWORKS</h3>
<p>Tuesday, July 5, 2011, 13:00, EV003.309<br />
    <br />
    <br />
    <span style="font-weight: bold"> Abstract:</span></p>
<p>Wireless communication networks need utilization of their channels to   achieve a desired goal. The problem of allocating the channels in an   efficient manner in order to get maximum output is of vital importance.   In the present investigation, optimal channel allocation scheme in   cellular radio system is suggested by reserving a specific number of   channels for handoff calls to give them priority in comparison to new   calls. The provision of sub-rating and buffer is made. The calls are   assumed to arrive in Poisson fashion whereas the service times along   with cell residence time are exponentially distributed. To establish   steady state indices, product method is employed by balancing the   in-flow and out-flow rates. Runge-Kutta (R-K) technique is used to   obtain the solution of the system of transient equations. Various   performance indices are also established in terms of transient   probabilities. The sensitivity analysis is also carried out to examine   the effects of various system parameters on the performance measures. </p>
<p style="font-weight: bold">Bio:</p>
<p>Dr Madhu Jain is a faculty in the Department of Mathematics, Indian   Institute of Technology Roorkee, India. She is recipient of two gold   medals at M. Phil. level. There are more than 200 research publications   in reputed journals including Applied Mathematical Modeling, Applied   Mathematics and Computation, Computers and Operations Research,   Computers in Biology and Medicine, etc. She was conferred Young   Scientist Award, Department of Science and Technology (India) and Career   Award, University Grant Commission (India). Her current research   interest includes queueing theory, stochastic models, software   reliability, wireless communication, Bio-informatics, etc. </p>
<p align="center">________________________________________________</p>
<h3>Lecture by Narsingh Deo (Director, Center for Parallel Computation at University of Central Florida) :</h3>
<p>&nbsp;</p>
<h3>DESIGNING MULTIPLE-FAULT TOLERANT RAID'S: A GRAPH-THEORETIC ALGORITHM FOR DATA AND PARITY PLACEMENT</h3>
<p>Monday, July 4, 2011 from 10:00 - 11:00am in EV3.309<br />
  <br />
  <br />
  <span style="font-weight: bold"> Abstract:</span></p>
<p>Redundant Arrays of Independent Disks (RAID) systems have  come into widespread use because of their enhanced I/O bandwidths, large  capacities, and low cost. However, the increasing demand for greater array  capacities at low cost has led to the use of arrays with larger and larger  number of disks, which increases the likelihood of the concurrent occurrence of  two or more random disk failures. Hence the need for RAID systems to tolerate  two or more random disk failures without compromising disk utilization. In this  talk, we will present a novel algorithm based on the perfect 1-factorization of  the complete graphs <a name="OLE_LINK1"><em>KP </em></a>and <em>K</em>2<em>P</em> &ndash; 1 for placing data and parity in two-disk fault-tolerant arrays with (<em>P</em> &ndash; <em>k</em>) and (2<em>P</em> &ndash; 1 &ndash; <em>k</em>) disks respectively, where <em>P</em> is a prime number and <em>k </em>&ge; 1. Furthermore, we determine the fraction of  space used for storing parity in such arrays and show that this fraction has  the optimal value when <em>k </em>= 1.</p>
<p style="font-weight: bold">Bio:</p>
<p>Narsingh Deo is the Millican Chair Professor of Computer  Science and Director of the Center for Parallel Computation at University of Central Florida.&nbsp;  A Fellow of the IEEE and a Fellow of the ACM, Prof. Deo has authored  four textbooks and over 200 refereed papers on graph theoretic algorithms,  combinatorial computing, discrete optimization, and parallel computation.</p>
<p align="center">________________________________________________</p>
<p>&nbsp;</p>
<h3>Lecture by  T.S. Mohan (Principal Researcher, Infosys Technologies E&amp;R ECom Research Lab) :</h3>
<h3>&nbsp;</h3>
<h3>THE GRAND CHALLENGES IN SOFTWARE ENGINEERING - PERSPECTIVES FROM THE TRENCHES </h3>
<p> Tuesday, June 7, 2011 from 10:30-11:30AM in EV003.309   <br />
    <br />
    <br />
    <span style="font-weight: bold"> Abstract:</span></p>
<p>While Software Engineering  traditionally has not been widely popular amongst the industrial software development  practitioners,its maturity and need is being felt by these practitioners all  the more. Is it that the field of Software Engineering is stagnating? An analysis  of the paper presentation by topic in the recently concluded ICSE 2011  conference shows the disturbing imbalances in the priorities of the Software  Engineering research being pursued. In this talk, which was delivered at the ICSE'2011 conference, we highlight the role played by  Grand Challenge initiatives and the need for it in contemporary software  engineering research.We highlight these grand challenge opportunities in six  areas of advanced software engineering - more so in the context of Cloud  Computing, ubiquitous networked smart devices, social networks, rapid software development,  compositionality of components and services and secure testing and validation.</p>
<p style="font-weight: bold">Bio:</p>
<p>T.S. Mohan works at Infosys  Technologies E&amp;R&rsquo;s ECom Research Lab as a Principal Researcher. His  research interests include distributed systems, high performance computing,  cloud and grid as well as software architecture and Software engineering. He has  over 22 years experience in the academia and industry. T.S. Mohan holds a  Master and PhD in computer science from the Indian Institute of Science,  Bangalore where he worked for about a decade before moving into the industry.  He was a young visiting scientist in the Lab for Computer Science, MIT in 1988  and a visiting scientist in NEC Research Institute, Princeton in the summer of  1994. He pursued his entrepreneurial interests in Bangalore in advanced  computing technologies for about 6 years before joining Infosys. He is the  c0-Chair of the Software Engineering in Practice Track of International  Conference on Software Engineering (ICSE) 2011 Conference as well as Co-Chair  of the International Workshop on Software Engineering for Cloud Computing, 2011  and International Workshop on Future of Software Engineering in/for Cloud  Computing 2011 (FoSEC 2011). </p>
<p align="center">________________________________________________</p>
<h3>Lecture by Anant Madabhushi (Department of Biomedical Engineering, Rutgers  University) :</h3>
<h3>&nbsp;</h3>
<h3>DIGITAL AND INTEGRATED DIAGNOSTICS: CHALLENGES AND OPPORTUNITIES </h3>
<p> Wednesday, March 16, 2011 from 10:00-11:00am in EV2.260   <br />
    <br />
    <br />
    <span style="font-weight: bold"> Abstract:</span></p>
<p>With the advent of digital pathology, imaging scientists have begun to   develop computerized image analysis algorithms for making diagnostic   (disease presence), prognostic (outcome prediction), and theragnostic   (choice of therapy) predictions from high resolution images of digitized   histopathology. One of the caveats to developing image analysis   algorithms for digitized histopathology is the ability to deal with   highly dense, information rich datasets; datasets that would overwhelm   most computer vision and image processing algorithms. Over the last   decade, manifold learning and nonlinear dimensionality reduction schemes   have emerged as popular and powerful machine learning tools for pattern   recognition problems. However, these techniques have thus far been   applied primarily to classification and analysis of computer vision   problems (e.g., face detection). In this paper, we discuss recent work   by our group in the application of manifold learning methods to problems   in computer aided diagnosis, prognosis, and theragnosis of digitized   histopathology. In addition, we discuss some exciting recent   developments in the application of these methods for multi-modal data   fusion and classification; specifically the building of meta-classifiers   by fusion of histological image and "omics" signatures for prostate and   breast cancer outcome prediction.</p>
<p style="font-weight: bold">Bio:</p>
<p>Dr. Anant Madabhushi is the Director of the <strong><u>Laboratory for Computational Imaging and  Bioinformatics</u></strong> (LCIB), Department of Biomedical Engineering, Rutgers  University. Dr. Madabhushi received his Bachelors Degree in Biomedical  Engineering from Mumbai University, India in 1998 and his Masters in Biomedical  Engineering from the University of Texas, Austin in 2000. In 2004 he obtained  his PhD in Bioengineering from the University of Pennsylvania. He joined the  Department of Biomedical Engineering, Rutgers University as an Assistant  Professor in 2005. He was promoted to Associate Professor with Tenure in 2010.  He is also a member of the Cancer Institute of New Jersey and an Adjunct  Assistant Professor of Radiology at the Robert Wood Johnson Medical Center, NJ.  Dr. Madabhushi has authored over 110 peer-reviewed publications in leading international  journals and conferences. He has one patent, 9 pending, and 5 provisional  patents in the areas of medical image analysis, computer-aided diagnosis, and  computer vision. He is an Associate Editor for IEEE Transactions on Biomedical  Engineering, IEEE Transactions on Biomedical Engineering Letters, BMC Cancer,  and Medical Physics. He is also on the Editorial Board of the Journal  Analytical and Cellular Pathology. He has been the recipient of a number of  awards for both research as well as teaching, including the Busch Biomedical  Award (2006), the Technology Commercialization Award (2006), the Coulter Phase  1 and Phase 2 Early Career award (2006, 2008), the Excellence in Teaching Award  (2007-2009), the Cancer Institute of New Jersey New Investigator Award (2007,  2009), the Society for Imaging Informatics in Medicine (SIIM) New Investigator  award (2008), and the Life Sciences Commercialization Award (2008). He is also  a Wallace H. Coulter Fellow and a Senior IEEE member. His research work has  received grant funding from the National Cancer Institute (NIH), New Jersey  Commission on Cancer Research, the Society for Imaging Informatics, the  Department of Defense, and from Industry.</p>
<p>&nbsp;</p>
<p align="center">________________________________________________</p>
<h3>&nbsp;</h3>
<h3>Lecture by Gene Cooperman:</h3>
<h3>&nbsp;</h3>
<h3>TEMPORAL DEBUGGING VIA FLEXIBLE CHECKPOINTING:&nbsp; CHANGING THE COST MODEL </h3>
<p> Monday, February 21, 2011 at 13:00 in EV002.260<br />
    <br />
    <br />
    <span style="font-weight: bold"> Abstract: </span><br />
    Debugging semantic errors remains one of the most time-consuming, and <br />
    sometimes frustrating, efforts in developing and maintaining programs. <br />
    A semantic error is uncovered, and the programmer then begins multiple <br />
    iterations within a debugger in order to build up a hypothesis about <br />
    the original program fault that caused the error.&nbsp; Examples of semantic <br />
    errors include segmentation fault, assertion failure, infinite loop, <br />
    deadlock, livelock, and missing synchronization locks. <br />
    <br />
    This talk describes a debugging approach based on a reversible   debugger, <br />
    sometimes known as a time-traveling debugger.&nbsp; This is a more natural <br />
    approach, since it allows a programmer during a single program run   to work <br />
    backwards from semantic error to earlier fault, and still earlier to   the <br />
    original causal fault.&nbsp; A new tool, reverse expression watchpoints,   allows <br />
    one to begin with a program error and an expression that has an   incorrect <br />
    value, and automatically bring the programmer backwards in time to a   point <br />
    at which the expression first took on an incorrect value.&nbsp; This tool is <br />
    part of a long-term project in which a series of such tools is planned, <br />
    each tool customized for a different class of semantic errors. <br />
    <br />
    The long-term goals described here are motivated by an analogy between <br />
    syntax errors and semantic errors: <br />
    <br />
    * Currently, syntax errors are easily diagnosed by compilers that bring <br />
    the programmer directly to the line number, withing a textual program, <br />
    that led to the bad syntax. <br />
    <br />
    * In the future, semantic errors will be easily diagnosed by a new   class <br />
    of reversible debugger tools that bring the programmer directly to the <br />
    point in time, within a familiar debugging environment, that led to the <br />
    later semantic error. <br />
    <br />
    The reversible debugger is itself based on a fast, transparent   checkpointing <br />
    package for Linux:&nbsp; DMTCP (Distributed MultiThreaded CheckPointing). <br />
    DMTCP can checkpoint such varied programs as Matlab, OpenMPI, MySQL, <br />
    Python, Perl, GNU screen, Vim, Emacs, and most user-developed programs, <br />
    regardless of the implementation language.&nbsp; No kernel modification or <br />
    other root privilege is needed.&nbsp; Of particular interest for this talk <br />
    is the ability of a customized version of DMTCP to checkpoint an entire <br />
    gdb session.&nbsp; The reversible debugger also supports weak determinism   for <br />
    purposes of debugging multi-threaded programs.&nbsp; The current   implementation <br />
    has been demonstrated robust enough to run such large, real-world   programs <br />
    as MySQL and Firefox. </p>
<p><span style="font-weight: bold">Bio:</span> <br />
  Gene Cooperman received his Ph.D. from Brown University in 1978.&nbsp; He   spent <br />
  two years as a post-doc, followed by six years at GTE Laboratories. <br />
  He has been a professor at Northeastern University since 1986, and <br />
  a full professor since 1992.&nbsp; His interests lie in high performance <br />
  computation and symbolic algebra.&nbsp; He has developed Task-Oriented <br />
  Parallel C (TOP-C/C++), a model for writing parallel software easily. <br />
  More recently, he has worked with novel applications of transparent <br />
  checkpointing, such as checkpointing symbolic debuggers and   checkpointing <br />
  individual graphics-based processes with a graphics desktop.&nbsp; His DMTCP <br />
  checkpointing project provides a robust platform for this purpose, while <br />
  not requiring modifications to the application or kernel/run-time   library. <br />
  His disk-based parallel computation project (joint with Daniel Kunkle) <br />
  is based on the Roomy language extension, and translates traditional <br />
  RAM-intensive computations into scalable computations based on parallel <br />
  disks.&nbsp; Finally, he works on the semi-automatic source-level translation <br />
  of single-threaded task-oriented programs into multi-threaded programs <br />
  with a small footprint.&nbsp; This work is an important focus of his ongoing <br />
  collaboration with CERN, and the work is motivated by the requirements <br />
  of future many-core CPU chips.&nbsp; He leads the High Performance Computing <br />
  Laboratory at Northeastern University, where he currently advises four <br />
  PhD students.&nbsp; He has over 80 refereed publications. <br />
  <br />
</p>
<p align="center">________________________________________________</p>
<p></p>
<h3>Lecture by David Wessel (CNMAT,  University of California Berkeley):</h3>
<h3>&nbsp;</h3>
<h3>PARALLELIZATION OF MUSIC AND AUDIO APPLICATIONS </h3>
<p>November 26, 2010 at 1:00PM in EV2.260<br />
  <br />
    <br />
    <span style="font-weight: bold">Abstract: </span><br />
    Multi-core processors are now common but musical and audio applications <br />
  that take advantage of multiple cores are rare. The most popular music <br />
  software programming environments are sequential in character and <br />
  provide only a modicum of support for the efficiencies to be gained from <br />
  parallelization. We provide a brief summary of existing facilities in <br />
  the most popular languages and provide examples of parallel <br />
  implementations of some key algorithms in computer music such as <br />
  partitioned convolution and non-negative matrix factorization NMF.We <br />
  follow with a brief description of the SEJITS approach to providing <br />
  support between the productivity layer languages used by musicians and <br />
  related domain experts and efficient parallel implementations.We also <br />
  consider the importance of I/O in computer architectures for music and <br />
  audio applications. We lament the fact that current GPU architectures as <br />
  delivered in desk and laptop processors are not properly harnessed for <br />
  low-latency real-time audio applications. <br />
    <br />
    <span style="font-weight: bold">Bio:</span> <br />
    From his high school years onwards, David Wessel's musical  <br />
    activities were central to his life and after his PhD in Psychology he <br />
    committed himself to blending his science and technology skills with his <br />
    musical interests.In 1976, at the invitation of Pierre Boulez, he moved <br />
    to Paris to work as a researcher at the then nascent /Institut de <br />
    Recherche et Coordination Acoustic/Musique/IRCAM where he remained until <br />
    1988. For his work at IRCAM he was recognized as /Chevalier dans l'Ordre <br />
    des Arts et des Lettres/by the French Minister of Culture. <br />
    <br />
    In 1988, he arrived at UC Berkeley as Professor of Music with the charge <br />
    of building the interdisciplinary Center for New Music and Audio <br />
    Technologies (CNMAT).He organized CNMAT as a laboratory wherein both <br />
    science and technology people interact on daily basis with musicians. <br />
    Wessel insists on an instrumental conception &ndash; the computer as musical <br />
    instrument equipped with gesture sensing devices and sound diffusion <br />
    systems. <br />
  <br />
    <br />
</p>
<p align="center">________________________________________________</p>
<p><br />
</p>
<h3>Lecture by Dr. Peter Grogono on:</h3>
<h3>The Unbearable Dizziness of Rotating: A Mathematical History Tour </h3>
<p>Date and Location October 13th, Room EV3.309, 1:00 PM</p>
<p> We start the tour with observations about the implementation of rotation in current three-dimensional graphics programming.&nbsp; Standard texts convey the impression that the mathematics is conventional and that the main problem is to find a compromise between performance, precision, and numerical stability.&nbsp; The actual situation is more interesting. <br />
  <br />
The foundations of modern graphics programming were laid in the mid-nineteenth century by mathematicians such as Hamilton, Cayley, and Gibbs.&nbsp; Presentations create the illusion of coherence and completeness, but&nbsp; closer inspection of the original work reveals gaps, oddities, and a curious link between fermions, bosons, and Balinese candle dancers. <br />
<br />
Other nineteenth-century mathematicians, such as Grassmann, Rodrigues, Clifford, and Lie, produced consistent and elegant systems that, for various reasons, have not achieved the attention that they deserve in graphics and other fields.&nbsp; However, bits and pieces of these systems have been exploited by physicists for many years.&nbsp; Recently, there have been efforts to rebuild mechanics and physics on a single algebraic foundation.&nbsp; Algebraic techniques have also been introduced into graphics programming and may eventually come to dominate the field.&nbsp; We end the tour with a glimpse of a possible future for rotation in graphics programming. <br />
</p>
<p align="center">_________________________________________________</p>
<p align="center">&nbsp;</p>
<h3>Dr. Yue Lu from the Department of Computer Science and Technology, East China Normal University is giving a lecture titled :</h3>
<h3> <strong><em>Applications of Document Image Recognition to Postal Automation </em></strong> <br />
    <br />
    <a href="http://www.cse.concordia.ca/documents/research/Yue%20Lu.pdf">Date and time: August 10th, 10:00a.m EV11.119</a><br />
</h3>
<p>&nbsp;</p>
<p align="center">________________________________________________</p>
<p>&nbsp;</p>
<h3> Speaker: Dieter Rautenbach, Technische Universitaet Ilmenau <br />
  <br />
Title: Betweennesses induced by Forests and Set Systems - Structures <br />
and Algorithms <br />
<br />
Date and time: Friday 21 May, 15:00 in room EV2.260 <br />
</h3>
<p><br />
  <br />
Abstract: <br />
<br />
We study so-called betweennesses induced by graphs <br />
as well as set systems. Algorithmic problems related <br />
to betweennesses are typically hard. They have been <br />
studied as relaxations of ordinal embeddings and occur <br />
for instance in psychometrics and molecular biology. <br />
Our contributions are hardness results, efficient <br />
algorithms, and structural insights such as complete <br />
axiomatic characterizations. <br />
<br />
This is joint work with V. Santos, P.M. Schaefer, and J.L. Szwarcfiter </p>
<p>&nbsp;</p>
<p align="center">___________________________________________________</p>
<p>&nbsp;</p>
<h2> IEEE Women In Engineering (WIE) Mentoring Program </h2>
<p> lace: <br />
  <br />
EV3.309, CSE Department, Concordia University <br />
1515 Ste Catherine West, 3d floor <br />
Montreal, Quebec H3G 1M8 <br />
<br />
Abstract: <br />
<br />
The original Mentor is a character in Homer?s epic poem <strong>* The Odyssey * </strong>. When Odysseus, <br />
King of Ithaca, went to fight in the Trojan War, he entrusted the care of his kingdom to <br />
Mentor. Mentor served as the teacher and overseer of Odysseuss? son, Telemachus. <br />
In today's corporate nomenclature, mentorship refers to the relationship in which a more <br />
experienced or more knowledgeable person helps a less experienced or less knowledgeable <br />
person ? often referred as prot&eacute;g&eacute; or mentee. However there are many avenues to mentor or <br />
be mentored. This talk will discuss the speaker's experiences with mentoring. <br />
<br />
<br />
Speaker:&nbsp; Jennifer Ng , IEEE WIE Ottawa. <br />
<br />
Biography: <br />
<br />
Jennifer obtained her Bachelor of Electrical Engineering from McGill University , <br />
Montr&eacute;al, Canada (B.Eng ?94) and recently moved back to Canada after&nbsp; decade in the US. <br />
She works in Regulatory Affairs for Medical Devices at Abbott Point of Care&nbsp; in Ottawa. <br />
Jennifer has been a member of IEEE&nbsp; since 1990 and became a member of Women In <br />
Engineering (WIE ) in 1996.&nbsp; She has been involved in mentoring students (McGill Mentor <br />
Program) as well as peer IEEE members (IEEE mentoring service) over the past several <br />
years. For her full biography, go to <a href="http://www.jenniferng.org">http://www.jenniferng.org </a><br />
<br />
For more information, please, visit the IEEE WIE Montreal website at <br />
<br />
<a href="http://users.encs.concordia.ca/%7Eormandj/WIE-Montreal.html">http://users.encs.concordia.ca/~ormandj/WIE-Montreal.html </a><br />
</p>
<p align="center">___________________________________________________</p>
<h3>&nbsp;</h3>
<h3><strong><a href="http://www.cse.concordia.ca/documents/research/Freeman_InvitedTalk_Oct15.doc">Invited Speaker  Dr. Herbert Freeman</a> </strong></h3>
<h3 style="font-weight: bold">&quot; <strong><em>Labeling the Features of a Map  Solving a Problem that was Thought to be beyond Computer Solution &quot; </em></strong></h3>
<p><strong>DATE : </strong>Thursday, October 15 th , 2009, <strong>TIME: </strong>5:45 p.m., <strong>LOCATION: </strong>EV 3.309 </p>
<p align="center" style="font-weight: bold">------------------------------------------------------------------------------------------------------------</p>
<p><strong>Date:</strong> July 03, 2009 at 10:30 AM </p>
<p><strong>Location:</strong> EV003.309, 1515 St Catherine Street West</p>
<p><strong>Speaker:</strong> 


 Prof. K. K. Biswas</p>
<p><strong>Title: </strong> Recognizing individuals from the energy component of their walks</p>
<p><strong>Abstract: </strong></p>
<p> Image based human recognition methods&nbsp; such as fingerprints, palms, <br />
face,&nbsp; ear, iris etc. require the subject to cooperate to provide the <br />
relevant data. Recently gait has emerged as a new biometrics which is <br />
non-obtrusive in nature and concerns recognition of individuals by the <br />
way they walk. The spatial and temporal shape of motion of an individual <br />
is usually the same for all gait cycles and is considered to be unique <br />
to that individual. This talk will&nbsp; present schemes which make use of <br />
gait energy image&nbsp; representation. This basically involves capturing the <br />
human motion in a single image while preserving the temporal gait <br />
characteristics of the individual. The image does get disturbed when the <br />
subject is carrying a bag or wearing an overcoat. We shall illustrate <br />
how these effects can be minimized by using the spatio-temporal motion <br />
features through results on a large gait data set. <br />
<br />
<br />
<br />
Bio: <br />
<br />
Dr. K. K. Biswas is Professor in the conmputer science and engineering <br />
department of&nbsp; IIT Delhi, India since 1988. He has extensive research <br />
experience in the areas of image processing and computer vision. His <br />
primary areas of research include Fuzzy logic for content based image <br />
retrieval, Video Segmentation &amp; Categorization, Gait recognition <br />
technology for biometrics and Soft computing based activity recognition <br />
in video clips. He was visiting faculty in University of Central Florida <br />
during the period 2003-2007 and is member of the editorial board of <br />
international journals in his research field. </p>
<p>&nbsp;</p>
<p align="center">______________________________________________________________________________________</p>
<p>&nbsp;</p>
<p><strong>Date:</strong>  June 16, 2009 at 18:00 PM </p>
<p><strong>Location:</strong> EV003.309, 1515 St Catherine Street West</p>
<p><strong>Speaker:</strong> Emil Vassev, University College Dublin</p>
<p><strong>Title: </strong> Engineering Autonomic Systems with ASSL</p>
<p><strong>Abstract: </strong></p>
<p> Since its introduction in 2001 by IBM, autonomic computing has inspired many initiatives for self-management of complex systems. The Autonomic System Specification Language (ASSL) is an initiative that provides a framework for the specification, validation, and code generation of autonomic systems. A formal method dedicated to autonomic computing, ASSL helps researchers with problem formation and system design, analysis, evaluation, and implementation. The ASSL formal notation is a hierarchical specification model defined through formalization tiers. The framework provides a toolset that developers can use to edit and validate ASSL specifications and generate Java code. The current validation approach is a form of consistency checking performed against a set of semantic definitions. Currently, different verification mechanisms for automatic reasoning are under development, such as model checking support for both specification and post-implementation phases of the software lifecycle. ASSL has been successfully used to make existing and prospective complex systems autonomic. Here, autonomic properties have been specified and prototype models have been generated for two NASA projects ? the Autonomous Nano-Technology Swarm concept Mission and the Voyager mission. </p>
<p>&nbsp;</p>
<p align="center">_________________________________________________________________________________________________</p>
<p>&nbsp;</p>
<p><strong>Date:</strong> 4th, June 2009 at 10:00 AM </p>
<p><strong>Location:</strong> EV003.309, 1515 St Catherine Street West</p>
<p><strong>Speaker:</strong> Dr. Chi Hau Chen, University of Massachusetts Dartmouth</p>
<p><strong>Title: </strong> Signal Processing in Pattern Recognition</p>
<p><strong>Abstract: </strong></p>
<p> While the progresses in pattern recognition and signal processing have been going on nearly in parallel, in the past 50 years, the convergence of the two fields has been quite evident, especially on using signal (image) processing and modeling in preprocessing and feature extraction for pattern recognition. A good example is the transform methods in signal (image) processing which are used extensively in pattern recognition. In this talk we will examine the signal processing in pattern recognition applications with seismic, sonar and ultrasonic testing signals as well as remote sensing images. Special focus is placed on statistical pattern recognition issues in remote sensing. While pattern recognition applications are so diverse, signal processing has provided a common step toward building more effective pattern recognition systems. ------ Chi Hau Chen received his Ph.D. in electrical engineering from Purdue University in 1965. He has been a faculty member with the University of Massachusetts Dartmouth (UMass Dartmouth) since 1968 where he is now Chancellor Professor. He was the director of NATO Advanced Study Institute on Pattern Recognition and Signal Processing, held at ENST, Paris, 1978. Dr. Chen was the Associate Editor of IEEE Trans. on Acoustics, Speech and Signal Processing from 1982 to 1986, Associate Editor on information processing for remote sensing of IEEE Trans. on Geoscience and Remote Sensing 1985 to 2000. He is an IEEE Fellow 1988, Life Fellow 2003, and also a Fellow of International Association of Pattern Recognition (IAPR) 1996. He has been an Associate Editor of International Journal of Pattern Recognition and Artificial Intelligence since 1985, and on the Editorial Board of Pattern Recognition Journal since 2009. In addition to the remote sensing and geophysical applications of statistical pattern recognition, he has been active with the signal and image processing of medical ultrasound images as well as industrial ultrasonic data for nondestructive evaluation of materials He has published 25 books in his areas of research interest. </p>
<p>&nbsp;</p>
<p>_________________________________________________________________________________________________</p>
<p><strong>Date:</strong> 15, April 2009 at 12:00</p>
<p><strong>Location:</strong> EV002.184, 1515 St Catherine West, Montreal</p>
<p><strong>Speaker:</strong> U.S.R. Murty</p>
<p><strong>Title: </strong> The Perfect Matching Polytope and Solid Bricks</p>
<p><strong>Abstract: </strong></p>
<p>The perfect matching polytope of a graph G, denoted here by Poly(G), is the convex hull of the set of incidence vectors of perfect matchings of G. Edmonds (1965) showed that a vector x in R^E belongs to the perfect matching polytope of G if and only if it satisfies theinequalities: (i) x \geq 0 (non-negativity), (ii) x(\partial(v)) = 1, for all v in V (degree constraints) and (iii) x(\partial(S))\geq 1, for all odd subsets S of V (odd set constraints). We are interested in the problem of characterizing graphs whose perfect matching polytopes are determined by non-negativity and the degree constraints. It is well-known that bipartite graphs have this property. An graph is an Edmonds graph if the description of Poly(G) requires at least one odd set constraint. The Edmonds Graph Recognition Problem (EGP) is the problem of recognizing if a given graph is an Edmonds graph. By Edmonds? Theorem, EGP is in NP. We showed that for planar graphs EGP is in P. But, in general, we do not even know if EGP is in co-NP. In this talk I shall present a characterization of Edmonds graphs. A class of graphs known as solid bricks arise as important examples of non-Edmonds graphs.</p>
<p>Based on joint work with M. H. de Carvalho and C.L. Lucchesi. .**</p>
<hr>
<p>&nbsp;</p>

<a name="April-23-2009"></a>
<p><strong>Date:</strong> April 23, 2009 at 14:30</p>
<p><strong>Location:</strong> EV002.184, 1515 St Catherine West, Montreal</p>
<p><strong>Speaker:</strong> T.C. Nicholas Graham</p>
<p><strong>Title: </strong>Supporting Adaptive Mobile Collaboration</p>
<p><strong>Abstract:</strong></p>
<p>Recent years have seen a proliferation of exciting new mobile devices, such as Smartphones, Netbooks and ultra-light laptops. These provide ever more ways for people to communicate and collaborate on the go. Programming collaborative applications over mobile devices is challenging, as such applications must be high- performance, robust in the presence of failure (such as batteries dying or losing network connection), and easy to use in a mobile environment.</p>
<p>In this talk, I will present Fiia, a middleware toolkit aiding the development of collaborative applications in a mobile setting. Fiia's approach is model-based, allowing developers to manipulate a high-level conceptual model of their system, while a runtime refinery automatically resolves issues of distribution and partial failure.</p>
<p>Fiia has been used to develop systems as diverse as a collaborative game prototyping environment, a smartphone-based presentation tool, and a tabletop-based furniture sales system.</p>
<hr>
<p>&nbsp;</p>

<h3>Colloquium Series in Computer Science and Software Engineering</h3>
<p><strong>Speaker</strong>: Dr. Vasek Chvatal</p>
<p><strong>Date</strong>: Monday, March 2, 2009</p>
<p><strong>Location</strong>: EV 3.309, 1515 St Catherine St, Montreal</p>
<p><strong>Abstract:</strong></p>
<p>A point in the plane is said to lie between points A and C if it is the interior point of the line segment joining A and C. In his development of geometry, Euclid neglected to give the notion of betweenness the same axiomatic treatment that he gave, for instance, to the notion of equality. This omission was rectified twenty-two centuries later by Moritz Pasch: <a href="http://www-groups.dcs.st-and.ac.uk/~history/Biographies/Pasch.html">http://www-groups.dcs.st-and.ac. uk/~history/Biographies/Pasch.html </a></p>
<p>During the twentieth century, geometric betweenness was generalized in diverse branches of mathematics to ternary relations of metric betweennes, lattice betweenness, and algebraic betweenness. I will talk about three settings where such abstract betweennesses show up.</p>
<p>The first of these settings is ordered geometry; there, primitive notions of points and lines are linked by the relation of incidence and by axioms of betweenness; two classic theorems here are the Sylvester-Gallai theorem <a href="http://mathworld.wolfram.com/SylvestersLineProblem.html">http://mathworld.wolfram.com/SylvestersLineProblem.html</a><br />
and the de Bruijn-Erdos theorem. I conjectured in 1998 <a href="http://users.encs.concordia.ca/~chvatal/newsg.pdf">http://users.encs.concordia.ca/~chvatal/newsg.pdf</a> and Xiaomin Chen proved in 2003 <a href="http://dimacs.rutgers.edu/TechnicalReports/abstracts/2003/2003-32.html">http://dimacs.rutgers.edu/TechnicalReports/abstracts/2003/2003-32.html</a> that the&nbsp; Sylvester-Gallai theorem generalizes to metric spaces when lines in these spaces are defined right; together, we conjectured <a href="http://arxiv.org/abs/math.CO/0610036">http://arxiv.org/abs/math.CO/0610036</a> that the de Bruijn-Erdos theorem also generalizes to metric spaces when lines in these spaces are defined right (with "right" having a different sense in each of the two instances); the two of us and Ehsan Chiniforooshan have partial results on this conjecture.</p>
<p>The second of the three settings is abstract convexity; there, families of sets called "convex" obey certain axioms. Such finite structures are called convex geometries when they have the Minkowski-Krein-Milman property: every set is the convex hull of its extreme points. Two classical examples of convex geometries come from shelling of partially ordered sets and simplicial shelling of triangulated graphs. Last June I characterized, by a five-point condition, a class of betweennesses generating a class of convex geometries that subsumes the two examples. <a href="http://users.encs.concordia.ca/~chvatal/abc.pdf">http://users.encs.concordia.ca/~chvatal/abc.pdf </a> Laurent Beaudou, Ehsan Chiniforooshan, and I have additional results on such betweennesses.</p>
<p>The last setting lies between physics and philosophy: in his effort to develop a causal theory of time, Hans Reichenbach <a href="http://en.wikipedia.org/wiki/Hans_Reichenbach">http://en.wikipedia.org/wiki/Hans_Reichenbach </a> introduced the notion of causal betweenness, which is a ternary relation defined on events in probability spaces. This January, Baoyindureng Wu and I characterized, by easily verifiable properties, abstract ternary relations isomorphic to Reichenbach's causal betweenness. <br />
<a href="http://arxiv.org/abs/0902.1763">http://arxiv.org/abs/0902.1763 </a></p>
<p>A nice connection with a 1979 theorem of Jarda Opatrny <br />
<a href="http://dx.doi.org/10.1137/0208008">http://dx.doi.org/10.1137/0208008 </a><br />
appears here.</p>
<p>The joint work with Laurent Beaudou, Ehsan Chiniforooshan, and Baoyindureng Wu was done in our research group ConCoCO <a href="http://users.encs.concordia.ca/~concoco/">http://users.encs.concordia.ca/~concoco/ </a><br /> (Concordia Computational Combinatorial Optimization). </p>
<p><strong>Biography:</strong></p>
<p> Vasek Chvatal got his PhD in mathematics from the University of Waterloo in 1970. Before joining Concordia in June 2004 as its first Canada Research Chair in Tier 1, he taught mathematics, operations research, and computer science at McGill, Stanford, Universite de Montreal, and Rutgers. Information about his research is available at <a href="http://users.encs.concordia.ca/~chvatal/">http://users.encs.concordia.ca/~chvatal/ </a></p>
<hr />
<p>&nbsp;</p>

<h3>Past Events</h3>
<ul>
<li><strong><a href="http://www.cse.concordia.ca/documents/research/abstractaihua.pdf">April 14, 2009 </a></strong>- Defence given by Alina Andreevskaia "Sentence-Level Sentiment Tagging Across Different Domains"</li>
<li><strong><a href="http://www.cse.concordia.ca/documents/research/AmaniJamalAbst.pdf">April 9, 2009 </a></strong>- Defence given by Amani Jamal "A UML Framework for OLAP Conceptual Modeling"</li>
<li><strong><a href="http://www.cse.concordia.ca/documents/research/abstractaihua.pdf">April 9, 2009</a></strong> - Defence given by Ai Hua WU "OO-IP Hybrid Language Design and a Framework Approach to the GIPC"</li>
<li><strong><a href="http://www.cse.concordia.ca/documents/research/LehanMengAbst.pdf">April 8, 2009</a></strong> - Defence given by Lehan Meng "Multichannel Optical Access Networks: Design and Resource Management"</li>
<li><strong><a href="http://www.cse.concordia.ca/documents/research/MitraNamiAbst.pdf">April 8, 2009 </a></strong>- Defence given by Mitra Nami "ELIDE: An Interactive Development Environment for the Erasmus Language"</li>
<li><strong><a href="http://www.cse.concordia.ca/documents/research/RuhanSayeedAbst.pdf">April 6, 2009</a></strong> - Defence given by Ruhan Sayeed "High Performance Analytics with the R3-cache"</li>
<li><strong><a href="http://www.cse.concordia.ca/documents/research/ShafiqueAhmedAbst.pdf">April 6, 2009 </a></strong>- Defence given by Shafique Ahmed "Mining Software Repositories to Support Software Evolution"</li>
<li><strong><a href="http://www.cse.concordia.ca/documents/research/MuhammadShahAbst.pdf">April 3, 2009 </a></strong>- Defence given by Muhammad Ismail Shah "A Novel Image Matching Approach for Word Spotting"</li>
<li><strong><a href="http://www.cse.concordia.ca/documents/research/AbstractDania.pdf">April 2, 2009 </a></strong>- Defence given by Dania El-Khechen "Decomposing and Packing Polygons"</li>
<li><strong><a href="http://www.cse.concordia.ca/documents/research/FuzhiChenAbst.pdf">April 2, 2009 </a></strong>- Defence given by Fuzhi Chen "Visual Representation of a Customizable Software Maintenance Process Model"</li>
<li><strong><a href="http://www.cse.concordia.ca/documents/research/PhilonNguyenAbst.pdf">April 1 , 2009 </a></strong>- Defence given by Philon Nguyen "Fast and Scalable Similarity and Correlation Queries on Time Series Data"</li>
<li><strong><a href="http://www.cse.concordia.ca/documents/research/TahiraHasanAbst.pdf">March 31, 2009&nbsp;</a></strong> - Defence given by Tahira Hasan "Finding Usage Patterns from Generalized Weblog Data"</li>
<li><strong><a href="http://www.cse.concordia.ca/documents/research/abstractwumo.pdf">March 30, 2009 </a></strong>- Defence given by Wumo Pan "Pattern Detection and Recognition using Over-Complete and  Sparse Representations"</li>
<li><strong><a href="http://www.cse.concordia.ca/documents/research/G%20Jakadeesan.pdf">March 10, 2009 </a></strong>- Defence given by Gopinatha Jakadeesan "FT-PAS &ndash; A Framework for Pattern Specific Fault-Tolerance in Parallel Programming"</li>
<li><strong><a href="http://www.cse.concordia.ca/documents/research/LorenzoLucianoAbst.pdf">March 12, 2009 </a></strong>- Defence given by Lorenzo Luciano "An Automated Multimodal Face Recognition System Based on Fusion of Face and Ear"</li>
<li><strong><a href="http://www.cse.concordia.ca/documents/research/FrancoisCoallierSem.pdf">March 26, 2009 </a></strong>- Defence given by Fran&ccedil;ois Coallier "What Does Engineering Mean in 'Software Engineering'?"</li>
<li><strong>February 4, 2009</strong> - Defence given by Vahid Safar Nourollah "Automated Building Monitoring using a Wireless Sensor Network"</li>
<li><strong>February 9, 2009</strong> - Defence given by Ahmed Alasoud on "A Multi-Matching Technique for Combining Similarity Measures in Ontology Integration</li>
<li><strong>February 2, 2009</strong> - Seminar on "Secure Multicast Communications"presented by Dr.William Atwood.</li>
<li><strong>January 22, 2009</strong> - Defence given by Chen Na Lian on "Fast Computation of Supermaximal Repeats in DNA Sequences".   </li>
<li><strong>December 22nd, 2008</strong> - Seminar on"Biometrics and Gait Recognition", presented by Dr. Dr. Mounim A. El-Yacoubi , University in Casablanca, Morocco.</li>
<li><strong>December 22, 2008</strong> - Defence given by Naseem Ibrahim on "Transforming Architectural Descriptions of Component-based </li>
<li><strong>December 16, 2008</strong> - Defence given by  Jin Zan Lai on "Query Processing and Optimization in Deductive Databases with Certainty Constraints"</li>
<li><strong>December 09 , 2008</strong> - Seminar on"Linking Movie Data on the Web with LinkedMDB", presented by Dr. Mariano Consens, Information Engineering, MIE and CS, University of Toronto. </li>
<li><strong>December 08, 2008</strong> - Defence given by Hong Fei Zhu "Regression Test Selection for Distributed Java RMI Programs by Means of Formal Concept Analysis"</li>
<li><strong>December 05, 2008</strong> - Defence given by Daniel Sinnig on "Use Case and Task Models: Formal Unification and Integrated Development Methodology"</li>
<li><strong>December 04, 2008</strong> -                     Defence given by Yan Cheng on "A Multi-Panel QoS Control Communications Framework in Heterogeneous Networks".</li>
<li><strong>December 01, 2008</strong> - Defence given by Aleksey Izmailov on "A Fully Automated Real-time Eigenface-based Face Recognition System ".</li>
<li><strong>November 24, 2008</strong> -  Defence given by Louis Charbonneau on "Evolution of an Artificial Market and its use to Predict Future Stock Prices"</li>
<li><strong>November 26, 2008</strong> - Defence given by Nasim Farsiniamarj on "Combining Integer Programming and Tableau-based Reasoning: A Hybrid Calculus for the Description Logic SHQ"</li>
<li><strong>July 23, 2008</strong> - Seminar given by Prof. Dr. Forbrig (University of Rostock, Germany),"Task and Dialog Specifications for UI Development".</li>
<li><strong>April 28, 2008</strong> - Deadline for receiving poster abstracts for Poster session at AI 2008.</li>
<li><strong>February 12, 2008</strong> - Dr. John Plaice, from School of Computer Science and Engineering The University of New South Wales, Australia will give a public lecture on TransLucid, the Cartesian Programming Language at 10:00 AM in room EV003.309.</li>
</ul>
<!-- InstanceEndEditable --><script type="text/javascript" src="http://w.sharethis.com/widget/?tabs=web%2Cpost%2Cemail&charset=utf-8&services=reddit%2Cdigg%2Cfacebook%2Cmyspace%2Cdelicious%2Cstumbleupon%2Ctechnorati%2Cpropeller%2Cnewsvine%2Cblinklist%2Cfurl%2Cmixx%2Ccurrent%2Cgoogle_bmarks%2Cwindows_live%2Cyahoo_myweb&style=default&publisher=d17e3f55-ddc0-4679-9229-f11416ab3108"></script>

<br class="hide" />
			</div>

			</div>

		<div class="sidebar">
			<br class="hide" />
<!-- InstanceBeginEditable name="sidebar" --><!-- FCKEDITOR_sidebar --><!-- /FCKEDITOR_sidebar --> <!-- InstanceEndEditable -->

<!-- InstanceBeginEditable name="Sidebar"--><!-- InstanceEndEditable --><br class="hide" />
			</div>

				<div class="clear">&nbsp;</div>
	</div>



	<!-- MAIN CONTENT AREA - END -->


		
<h2 class="hide">Concordia University</h2>
<div id="footer">
  <div id="footer_links">
    <h2 class="hide">Tools &amp; Quicklinks</h2>
    <ul style="margin-bottom: 0;"><li><a href="http://www.concordia.ca/azindex/">A-Z Index</a></li>
      <li><a href="http://www.concordia.ca/directory/">Directory</a></li>
      <li><a href="http://www.concordia.ca/about/campusmaps/">Campus Map</a> </li>
      <li><a href="http://www.concordia.ca/busschedule.php">Shuttle Bus Schedule</a></li>
      <li><a href="http://myconcordia.ca">MyConcordia</a></li>
      <li><a href="https://mail.encs.concordia.ca/horde/imp/">Webmail</a></li>
      <li><a href="http://library.concordia.ca">Libraries</a></li>
      <li><a href="../../../pageswww.concordia.ca/about/jobopportunities/index.html">Jobs</a></li>
      <li><a href="../../../pageswww.concordia.ca/index.html">Giving to Concordia</a></li>
    </ul>
  </div>
 
 <div class="clear">&nbsp;</div>
  <div class="contactinfo"> <a href="../../../pageswww.concordia.ca/index.html"><img src="http://www.cse.concordia.ca/images/common/concordialogo_bottom.gif" alt="Concordia University Logo" /></a>
    <div id="footer_address" class="vcard">
      <p style="margin-bottom: 0"><strong> <span class="fn">Concordia University - <strong><span class="fn">Computer Science &amp; Software Engineering</span></strong></span></strong><br />
        <span class="adr"><span class="street-address">1515 St. Catherine St. West, </span><span class="locality">Montreal</span>, <span class="region">Quebec</span>, <span class="country-name">Canada</span> <span class="postal-code">H3G 1M8</span></span><br />
        Telephone <span class="tel">(1) 514-848-2424</span>  ext. 3000<br />
        <a href="../../aboutthedepartment/contactus/index.html" class="url">Contact Us</a> | <a href="http://www.concordia.ca/about/contactus/">University Mailing Address</a> | <a href="http://www.cse.concordia.ca/aboutthissite.php">About This Site</a><br />
      Copyright &copy; 2011 <span class="org">Concordia University</span> | <a href="http://www.cse.concordia.ca/legalnotice.php">Legal Notice</a></p>
    </div>
  </div>
  <div id="backtotop">
    <p style="margin-bottom: 0"><a href="http://www.cse.concordia.ca/newsandevents/lectureseries/#top">Back to Top</a></p>
  </div>
  <div class="url">
    <h2>Page Info</h2>
    <p><strong>Page Title</strong>: Lecture Series - Concordia University - Montreal, Quebec, Canada</p>
    <p><strong>Page URL</strong>:http://www.cse.concordia.ca/newsandevents/lectureseries/index.php ...</p>
    <p style="margin-bottom: 0;"><strong>Date Printed</strong>: Thu December 15, 2011</p>
  </div>
  <div class="clear">&nbsp;</div>
</div>
<div id="search_listing_disabled"  style="display:none; z-index:-100;">
	<div id="local_site_list">
			</div>
		<div id="search_staff_directory" style="position:absolute; z-index:200; left:0; top:0;"> </div>	
</div>
<div id="search_listing" style="display:none; z-index:-100;"> </div>

<div id="sharethis_holder">
	<script type="text/javascript" src="http://web2.concordia.ca/globalmk/scripts/sharethis.js"> </script>
</div>


<script type="text/javascript">
	var gaJsHost = (("https:" == document.location.protocol) ? "https://ssl." : "http://www.");
	document.write(unescape("%3Cscript src='" + gaJsHost + "google-analytics.com/ga.js' type='text/javascript'%3E%3C/script%3E"));
	</script>
	<script type="text/javascript">
	
	// Central Tracking
	var pageTracker_central = _gat._getTracker("UA-2729211-1");
	pageTracker_central._setDomainName(".concordia.ca");
	pageTracker_central._setAllowHash(false);
	pageTracker_central._initData();
	pageTracker_central._trackPageview();
	
</script>


</div>
</body>
<!-- InstanceEnd --></html>
